Computing Sharp Bounds of Metric Based Fractional Dimensions for the Sierpinski Networks
نویسندگان
چکیده
The concept of metric dimension is widely applied to solve various problems in the different fields computer science and chemistry, such as networking, integer programming, robot navigation, formation chemical structuring. In this article, local fractional (LFMD) cycle-based Sierpinski networks computed with help its resolving neighborhoods all adjacent pairs vertices. addition, boundedness LFMD also examined order approaches infinity.
منابع مشابه
Sharp Weighted Bounds for Fractional Integral Operators
The relationship between the operator norms of fractional integral operators acting on weighted Lebesgue spaces and the constant of the weights is investigated. Sharp bounds are obtained for both the fractional integral operators and the associated fractional maximal functions. As an application improved Sobolev inequalities are obtained. Some of the techniques used include a sharp off-diagonal...
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملSharp lower bounds on the fractional matching number
A fractional matching of a graph G is a function f from E(G) to the interval [0, 1] such that ∑ e∈Γ(v) f(e) ≤ 1 for each v ∈ V (G), where Γ(v) is the set of edges incident to v. The fractional matching number of G, written α′∗(G), is the maximum of
متن کاملBounds on the metric and partition dimensions of a graph
Given a graph G, we say S ⊆ V (G) is resolving if for each pair of distinct u, v ∈ V (G) there is a vertex x in S where d(u, x) 6= d(v, x). The metric dimension of G is the minimum cardinality of all resolving sets. For w ∈ V (G), the distance from w to S, denoted d(w, S), is the minimum distance between w and the vertices of S. Given P = {P1, P2, . . . , Pk} an ordered partition of V (G) we sa...
متن کاملSharp General and Metric Bounds for the Star Discrepancy of Perturbed Halton–kronecker Sequences
We consider distribution properties of two-dimensional hybrid sequences (zk)k in the unit square of the form zk = ({kα}, xk), where α ∈ (0, 1) is irrational and (xk)k denotes a digital Niederreiter sequence. By definition, the construction of the sequence (xk)k relies on an infinite matrix C with entries in {0, 1}. Two special cases of such matrices were studied by Niederreiter (2009) and by Ai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10224332